About the generalized LM-inverse and the weighted Moore-Penrose inverse
نویسندگان
چکیده
The recursive method for computing the generalized LM inverse of a constant rectangular matrix augmented by a column vector is proposed in [16, 17]. The corresponding algorithm for the sequential determination of the generalized LM -inverse is established in the present paper. We prove that the introduced algorithm for computing the generalized LM inverse and the algorithm for the computation of the weighted Moore-Penrose inverse developed by Wang in [23] are equivalent algorithms. Both of the algorithms are implemented in the present paper using the package MATHEMATICA. Several rational test matrices and randomly generated constant matrices are tested and the CPU time is compared and discussed. AMS Subj. Class.: 15A09, 68W30.
منابع مشابه
An Efficient Schulz-type Method to Compute the Moore-Penrose Inverse
A new Schulz-type method to compute the Moore-Penrose inverse of a matrix is proposed. Every iteration of the method involves four matrix multiplications. It is proved that this method converge with fourth-order. A wide set of numerical comparisons shows that the average number of matrix multiplications and the average CPU time of our method are considerably less than those of other methods.
متن کاملThe weighted Moore–Penrose generalized inverse and the force analysis of overconstrained parallel mechanisms
This paper reveals the relationship between the weighted Moore–Penrose generalized inverse and the force analysis of overconstrained parallel mechanisms (PMs), including redundantly actuated PMs and passive overconstrained PMs. The solution for the optimal distribution of the driving forces/torques of redundantly actuated PMs is derived in the form of a weighted Moore–Penrose inverse. Therefore...
متن کاملThe reverse order law for Moore-Penrose inverses of operators on Hilbert C*-modules
Suppose $T$ and $S$ are Moore-Penrose invertible operators betweenHilbert C*-module. Some necessary and sufficient conditions are given for thereverse order law $(TS)^{ dag} =S^{ dag} T^{ dag}$ to hold.In particular, we show that the equality holds if and only if $Ran(T^{*}TS) subseteq Ran(S)$ and $Ran(SS^{*}T^{*}) subseteq Ran(T^{*}),$ which was studied first by Greville [{it SIAM Rev. 8 (1966...
متن کاملThe M–matrix Moore–Penrose inverse problem for weighted paths
Abstract. A well–known property of an irreducible non–singular M–matrix is that its inverse is non–negative. However, when the matrix is an irreducible and singular M–matrix it is known that it has a generalized inverse which is non–negative, but this is not always true for any generalized inverse. We focus here in characterizing when the Moore–Penrose inverse of a symmetric, singular, irreduci...
متن کاملIdempotents Related to the Weighted Moore–penrose Inverse
We investigate necessary and sufficient conditions for aae,f = bb † e,f to hold in rings with involution. Here, ae,f denotes the weighted Moore-Penrose inverse of a, related to invertible and Hermitian elements e, f ∈ R. Thus, some recent results from [7] are extended to the weighted Moore-Penrose inverse.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Applied Mathematics and Computation
دوره 216 شماره
صفحات -
تاریخ انتشار 2010